34 research outputs found
A Method to determine Partial Weight Enumerator for Linear Block Codes
In this paper we present a fast and efficient method to find partial weight
enumerator (PWE) for binary linear block codes by using the error impulse
technique and Monte Carlo method. This PWE can be used to compute an upper
bound of the error probability for the soft decision maximum likelihood decoder
(MLD). As application of this method we give partial weight enumerators and
analytical performances of the BCH(130,66), BCH(103,47) and BCH(111,55)
shortened codes; the first code is obtained by shortening the binary primitive
BCH (255,191,17) code and the two other codes are obtained by shortening the
binary primitive BCH(127,71,19) code. The weight distributions of these three
codes are unknown at our knowledge.Comment: Computer Engineering and Intelligent Systems Vol 3, No.11, 201
A dynamic study with side channel against An Identification Based Encryption
Recently, the side channel keeps the attention of researchers in theory of pairing, since, several studies have been done in this subject and all them have the aim in order to attack the cryptosystems of Identification Based Encryption (IBE) which are integrate into smart cards (more than 80% of those cryptosystems are based on a pairing). The great success and the remarkable development of the cryptography IBE in the recent years and the direct connection of this success to the ability of resistance against any kind of attack, especially the DPA and DFA attacks, leave us to browse saying all the studies of the DPA and DFA attacks applied to a pairing and we have observed that they have no great effect to attack the cryptosystems of IBE. That’s what we will see in this paper. In this work we will illuminate the effect of the DPA attack on a cryptosystems of IBE and we would see on what level we can arrive. Thus in the case where this attack can influence on those cryptosystems, we can present an appropriate counter measures to resist such attack. In the other part we will also propose a convenient counter-measure to defend the attack DFA when the embedding degree is eve
Bitcoin Security with a Twisted Edwards Curve
International audienceThe security of the Bitcoin cryptocurrency system depends on the Koblitz curve secp256k1 combined with the digital signature ECDSA and the hash function SHA-256. In this paper, we show that the security of Bitcoin with ECDSA and secp256k1 is not optimal and present a detailed study of the efficiency of Bitcoin with the digital signature algorithm Ed25519 combined with the twisted Edwards curve CurveEd25519 and the hash function SHA-512. We show that Bitcoin is more secure and more efficient with the digital signature algorithm Ed25519 and the twisted Edwards curve CurveEd25519. Subject Classifications: 94A6
Decoding of Block Codes by using Genetic Algorithms and Permutations Set
Recently Genetic algorithms are successfully used for decoding some classes of error correcting codes. For decoding a linear block code C, these genetic algorithms computes a permutation p of the code generator matrix depending of the received word. Our main contribution in this paper is to choose the permutation p from the automorphism group of C. This choice allows reducing the complexity of re-encoding in the decoding steps when C is cyclic and also to generalize the proposed genetic decoding algorithm for binary nonlinear block codes like the Kerdock codes. In this paper, an efficient stop criterion is proposed and it reduces considerably the decoding complexity of our algorithm. The simulation results of the proposed decoder, over the AWGN channel, show that it reaches the error correcting performances of its competitors. The study of the complexity shows that the proposed decoder is less complex than its competitors that are based also on genetic algorithms
Identification Based Encryption with RSA-OAEP. Using SEM and Without
In this article we show how we can integrate the RSA (RSA-OAEP) into the IBE. Our prove can be make with either Standard Model or Random Oracle. We firstly develop the basic ideas made in this direction, so that to create a novel scheme with which we can signs and crypt at the same time. Then we give our new approach which conserves properly the syntax of the RSA classic. Additionally we compare our authentication with the signature of Shamir. More than that, in the RSA-IBE there is the problem of relating the exponent with an identity. Even if, there was some proposals in this direction, but they operate only with the Random Oracle. And in this article we will response to question of Xuhua Ding and Gene Tsudik, in order to propose an efficient exponent for an RSA-IBE. In the end of the article we give a useful appendix
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
The evaluation of the minimum distance of linear block codes remains an open
problem in coding theory, and it is not easy to determine its true value by
classical methods, for this reason the problem has been solved in the
literature with heuristic techniques such as genetic algorithms and local
search algorithms. In this paper we propose two approaches to attack the
hardness of this problem. The first approach is based on genetic algorithms and
it yield to good results comparing to another work based also on genetic
algorithms. The second approach is based on a new randomized algorithm which we
call Multiple Impulse Method MIM, where the principle is to search codewords
locally around the all-zero codeword perturbed by a minimum level of noise,
anticipating that the resultant nearest nonzero codewords will most likely
contain the minimum Hamming-weight codeword whose Hamming weight is equal to
the minimum distance of the linear code